FPT hardness for Clique and Set Cover with super exponential time in k
نویسندگان
چکیده
We give FPT-hardness for setcover and clique with super exponential time in the parameter k. Under the ð and pgc we prove that setcover admits no log k ratio, for c > 0 for any algorithm with running t(k) = exp ( k(log k) f ) ) · poly(n) for constant f > 0. Under the eth alone, we prove that setcover admits no √ log k ratio, in time exp ( k(log f k) ) · poly(n) for constant f > 0. Under the eth we prove clique admits no (c, t(k)), approximation, for any constant c in time exp(exp(kd)) with d a constant that depends on c.
منابع مشابه
Reducing the optimum value: FPT inapproximability, for Set Cover and Clique, in time super-exponential in opt
Fixed parameter ρ(k) inapproximability in minimization problems, is given some instance I of a problem with optimum opt, find some k ≥ opt and prove that it is not possible to compute a solution of value ρ(k) · k, usually, under the Exponential Time Conjecture eth. If opt is known inapproximability in terms of opt implies inapproximability in terms of k. An (r, t)-fpt-hardness is showing that t...
متن کاملReducing the value of the optimum: FPT inapproximability for Set Cover and Clique, in super exponential time in opt
In Fixed Parameter Tractability (FPT) theory, we are given a problem with a special parameter k. In this paper we are only interested in k equal the size of the optimum. A FPT algorithm for a problem is an exact algorithm that runs in time h(k) · nO(1) for a function h that may be arbitrarily large. In FPT approximation we seek a g(k) ratio that runs in time h(k) · nO(1), so that h,g are two in...
متن کاملReducing the optimum value: FPT inapproximability, for Set Cover and Clique, in time super-exponential in opt
Fixed parameter ρ(k) inapproximability in minimization problems, is given some instance I of a problem with optimum opt, find some k ≥ opt, prove that it is not possible to compute a solution of value ρ(k) · k, usually, under the Exponential Time Hypothesis (eth). If opt is known, inapproximability in terms of opt implies inapproximability in terms of k. An (r, t)-fpt-hardness (in opt) for two ...
متن کاملReducing the Optimum: Fixed Parameter Inapproximability for Clique and Set Cover in Time Super-exponential in Optimum
A minimization problem is called fixed parameter ρinapproximable, for a function ρ ≥ 1, if there does not exist an algorithm that given a problem instance I with optimum value opt and an integer k, either finds a feasible solution of value at most ρ(k) ·k or finds a certificate that k < opt in time t(k) · |I| for some function t. For maximization problem the definition is similar. We motivate t...
متن کاملUsing the PCP in proving Fixed parameter inapproximability
A problem P is (r, t)-FPT-inapproximable if the problem admits no r(k) approximation that runs in time t(k) · n for a constant c. We deal with hardness of approximation of setcover and clique. A feature of our scheme is that we only use k = opt(I) for some instance I, and so the hardness in k directly implies (r(opt(I)), t(opt(I)))hardness. The way Fixed Parameter hardness was proved. before ou...
متن کامل